BGCFI: Efficient Verification in Fine-Grained Control-Flow Integrity Based on Bipartite Graph

Control-flow integrity (CFI) is considered a principled mitigation against control-flow hijacking even under the most powerful attacker who can arbitrarily write and read memory. However, existing schemes still demonstrated limitations in either guaranteeing high security level or achieving low performance memory overhead. These have restricted application of CFI real software. To improve its applicability similar to mandatory protection such as DEP ASLR, it essential both guarantee In this paper, we propose “BGCFI”, which fine-grained based on Bipartite Graph. The relationship between an indirect branch valid target address at represented by edge bipartite graph. verification achieved checking existence corresponding method for results more efficiency computational overhead, while completely preserving guarantee. We demonstrate our through implementation proof-of-concept module evaluation SPEC CPU 2017 suite Firefox browser.